Dominion -- A constraint solver generator
نویسنده
چکیده
This paper proposes a design for a system to generate constraint solvers that are specialised for specific problem models. It describes the design in detail and gives preliminary experimental results showing the feasibility and effectiveness of the approach.
منابع مشابه
A Constraint Solver Synthesiser: Case for Support
This document is the case for support for Grant number EP/H004092/1, funded by the EPSRC in the UK. Our aim is to improve dramatically the scalability of constraint technology, while removing its reliance on manual tuning by an expert. This aim will be realised through the development of a constraint solver synthesiser, the principal components of which are a Model Analyser, a Constraint Solver...
متن کاملTowards a Generic Interface to Integrate CLP and Tabled Execution (Extended Abstract)
Logic programming systems featuring Constraint Logic Programming (Jaffar and Ma-her 1994) and tabled execution (Tamaki and Sato 1986; Warren 1992) have been shown to increase the declarativeness and efficiency of Prolog, while at the same time making it possible to write very expressive programs. Previous implementations fully integrating both capabilities (i.e., forcing suspension, answer subs...
متن کاملSimulation of Strap-On Boosters Separation in the Atmosphere
A numerical dynamic-aerodynamic interface for simulating the separation dynamics of constrained strap-on boosters jettisoned in the atmosphere is presented. A 6-DOF multi body dynamic solver ،using Constraint Force Equation Methodology is coupled with a numerical time dependent Euler flow solver. An automatic dynamic mesh updating procedure is employed using smoothing and l...
متن کاملStaff Scheduling with ILOG Solver
This paper describes the design and development of a staff scheduling software product called the Expert Rotation Generator (ERG). ERG’s scheduling engine uses ILOG’s Solver library to create staff rotations that satisfy a variety of staffing constraints in a reasonable amount of time. The user can interact with ERG during the generation process by modifying the constraints and by selecting a p...
متن کاملMonadic Constraint Programming with Gecode
This paper presents FD-MCP, a finite domain modeling language on top of the Monadic Constraint Programming framework for Haskell. FD-MCP leverages Haskell’s rich static type system and powerful abstraction mechanisms for implementing syntactic sugar, model transformations and compilation to solver backends. Two backends are provided: a basic Haskell solver and a Gecode code generator. Our bench...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1002.0136 شماره
صفحات -
تاریخ انتشار 2009